Connectivity Preserving Distributed Maximizing Coverage Algorithm for Three Dimensional Mobile Sensor Networks

نویسندگان

  • Mohammad Javad Heydari
  • Saeid Pashazadeh
چکیده

Considering an under supervised 3D space where a group of mobile devices with limited sensing and communicating capabilities are deployed, this paper aims at proposing a decentralized self-deployment algorithm for agents to get maximum connected coverage topology. The problem is modeled as maximization which is solved completely distributed. In fact each agent tries to maximize its sensing volume while preserving connectivity and having high quality communication links. Then each agent knowing distance of its neighbors defines an error function and tries to decrease the error by changing its positions through gradient descent algorithm. Keywords— mobile sensor networks, coverage, connectivity, QOS, gradient descent

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Representing a Model for Improving Connectivity and Power Dissipation in Wireless Networks Using Mobile Sensors

Wireless sensor networks are often located in areas where access to them is difficult or dangerous. Today, in wireless sensor networks, cluster-based routing protocols by dividing sensor nodes into distinct clusters and selecting local head-clusters to combine and send information of each cluster to the base station and balanced energy consumption by network nodes, get the best performance ...

متن کامل

Representing a Model for Improving Connectivity and Power Dissipation in Wireless Networks Using Mobile Sensors

Wireless sensor networks are often located in areas where access to them is difficult or dangerous. Today, in wireless sensor networks, cluster-based routing protocols by dividing sensor nodes into distinct clusters and selecting local head-clusters to combine and send information of each cluster to the base station and balanced energy consumption by network nodes, get the best performance ...

متن کامل

ENERGY AWARE DISTRIBUTED PARTITIONING DETECTION AND CONNECTIVITY RESTORATION ALGORITHM IN WIRELESS SENSOR NETWORKS

 Mobile sensor networks rely heavily on inter-sensor connectivity for collection of data. Nodes in these networks monitor different regions of an area of interest and collectively present a global overview of some monitored activities or phenomena. A failure of a sensor leads to loss of connectivity and may cause partitioning of the network into disjoint segments. A number of approaches have be...

متن کامل

Dynamic Obstacle Avoidance by Distributed Algorithm based on Reinforcement Learning (RESEARCH NOTE)

In this paper we focus on the application of reinforcement learning to obstacle avoidance in dynamic Environments in wireless sensor networks. A distributed algorithm based on reinforcement learning is developed for sensor networks to guide mobile robot through the dynamic obstacles. The sensor network models the danger of the area under coverage as obstacles, and has the property of adoption o...

متن کامل

A topology control algorithm for autonomous underwater robots in three-dimensional space using PSO

Recently, data collection from seabed by means of underwater wireless sensor networks (UWSN) has attracted considerable attention. Autonomous underwater vehicles (AUVs) are increasingly used as UWSNs in underwater missions. Events and environmental parameters in underwater regions have a stochastic nature. The target area must be covered by sensors to observe and report events. A ‘topology cont...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012